#define _CRT_SECURE_NO_WARNINGS 1
class Solution {
public:
    int coinChange(vector<int>& coins, int amount) {
        int m = coins.size(), n = amount;
        if (n == 0) return 0;
        vector<vector<int>> dp(m + 1, vector<int>(n + 1, 0x3f3f3f3f));
        dp[0][0] = 0;

        for (int i = 1;i <= m;i++)
        {
            for (int j = 0;j <= n;j++)
            {
                dp[i][j] = dp[i - 1][j];
                if (j >= coins[i - 1])
                    dp[i][j] = min(dp[i][j], dp[i][j - coins[i - 1]] + 1);
            }
        }
        return dp[m][n] >= 0x3f3f3f3f ? -1 : dp[m][n];
    }
};